21![References [1] F.S. de Boer, A. Di Pierro, and C. Palamidessi. Nondeterminism and Infinite Computations in Constraint Programming. Theoretical Computer Science, 151(1), 1995. Selected Papers of the Workshop on Topology a References [1] F.S. de Boer, A. Di Pierro, and C. Palamidessi. Nondeterminism and Infinite Computations in Constraint Programming. Theoretical Computer Science, 151(1), 1995. Selected Papers of the Workshop on Topology a](https://www.pdfsearch.io/img/3364f25442228465c4686695fb1c0b94.jpg) | Add to Reading ListSource URL: profs.sci.univr.itLanguage: English - Date: 2016-11-27 13:25:29
|
---|
22![Encoding Arguments PAT MORIN, Carleton University WOLFGANG MULZER, Freie Universit¨at Berlin TOMMY REDDAD, McGill University Many proofs in discrete mathematics and theoretical computer science are based on the probabi Encoding Arguments PAT MORIN, Carleton University WOLFGANG MULZER, Freie Universit¨at Berlin TOMMY REDDAD, McGill University Many proofs in discrete mathematics and theoretical computer science are based on the probabi](https://www.pdfsearch.io/img/75d363f3b9750c0687ee6f8acc17c0fa.jpg) | Add to Reading ListSource URL: page.mi.fu-berlin.deLanguage: English - Date: 2018-08-08 08:40:13
|
---|
23![Theoretical Computer Science–137 Contents lists available at SciVerse ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcs Theoretical Computer Science–137 Contents lists available at SciVerse ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcs](https://www.pdfsearch.io/img/7a069fee515571bb99bb6aa3e0b130bf.jpg) | Add to Reading ListSource URL: www.cs.haifa.ac.ilLanguage: English - Date: 2014-03-10 07:21:35
|
---|
24![Symposium on Theoretical Aspects of Computer ScienceBordeaux), ppwww.stacs-conf.org ON THE COMPLEXITY OF ELEMENTARY MODAL LOGICS EDITH HEMASPAANDRA AND HENNING SCHNOOR Department of Computer Science, Roc Symposium on Theoretical Aspects of Computer ScienceBordeaux), ppwww.stacs-conf.org ON THE COMPLEXITY OF ELEMENTARY MODAL LOGICS EDITH HEMASPAANDRA AND HENNING SCHNOOR Department of Computer Science, Roc](https://www.pdfsearch.io/img/79218e777cefac5e23023c71ebfbb4a0.jpg) | Add to Reading ListSource URL: drops.dagstuhl.deLanguage: English - Date: 2008-02-05 06:40:10
|
---|
25![34th International Symposium on Theoretical Aspects of Computer Science Program and Information
Conference Information 34th International Symposium on Theoretical Aspects of Computer Science Program and Information
Conference Information](https://www.pdfsearch.io/img/f13f213caa160a3b08abdf7e2ca24ad8.jpg) | Add to Reading ListSource URL: stacs2017.thi.uni-hannover.deLanguage: English - Date: 2018-05-04 04:12:23
|
---|
26![Theoretical Computer Science – 183 www.elsevier.com/locate/tcs Modular verification of multithreaded programs Cormac Flanagana,∗,1 , Stephen N. Freundb,1 , Shaz Qadeerc , Sanjit A. Seshiad,2 Theoretical Computer Science – 183 www.elsevier.com/locate/tcs Modular verification of multithreaded programs Cormac Flanagana,∗,1 , Stephen N. Freundb,1 , Shaz Qadeerc , Sanjit A. Seshiad,2](https://www.pdfsearch.io/img/149827e1635d6280d36ed7408c39a71a.jpg) | Add to Reading ListSource URL: dept.cs.williams.eduLanguage: English - Date: 2018-08-12 09:38:32
|
---|
27![Theoretical Computer Science – 434 www.elsevier.com/locate/tcs Scalar aggregation in inconsistent databases Marcelo Arenasa , Leopoldo Bertossib , Jan Chomickic;∗ , Xin Hec , Theoretical Computer Science – 434 www.elsevier.com/locate/tcs Scalar aggregation in inconsistent databases Marcelo Arenasa , Leopoldo Bertossib , Jan Chomickic;∗ , Xin Hec ,](https://www.pdfsearch.io/img/50dfb717e6b697bc70c49ee95f16ddf6.jpg) | Add to Reading ListSource URL: marenas.sitios.ing.uc.cl- Date: 2013-04-26 05:57:02
|
---|
28![A Rosenbrock-Nystrom State Space Implicit Approach for the Dynamic Analysis of Mechanical Systems: I – Theoretical Formulation ∗ Adrian Sandu Department of Computer Science, Michigan Technological University, Houghto A Rosenbrock-Nystrom State Space Implicit Approach for the Dynamic Analysis of Mechanical Systems: I – Theoretical Formulation ∗ Adrian Sandu Department of Computer Science, Michigan Technological University, Houghto](https://www.pdfsearch.io/img/bdb9c48794846591f509932187035eee.jpg) | Add to Reading ListSource URL: homepages.cae.wisc.edu- Date: 2003-06-21 13:24:32
|
---|
29![Preprint of paper: Theoretical Computer Science, vol), pp.177–196. Multi-Cut Preprint of paper: Theoretical Computer Science, vol), pp.177–196. Multi-Cut](https://www.pdfsearch.io/img/fa8be1f56ec06e71b97a99802fd80fbf.jpg) | Add to Reading ListSource URL: www.top-5000.nl- Date: 2007-02-08 07:59:24
|
---|
30![A New Variation of Hat Guessing Games Tengyu Ma1 , Xiaoming Sun1 , and Huacheng Yu1 Institute for Theoretical Computer Science Tsinghua University, Beijing, China Abstract. Several variations of hat guessing games have b A New Variation of Hat Guessing Games Tengyu Ma1 , Xiaoming Sun1 , and Huacheng Yu1 Institute for Theoretical Computer Science Tsinghua University, Beijing, China Abstract. Several variations of hat guessing games have b](https://www.pdfsearch.io/img/12b855ac9d8703a9d440f6883561a8db.jpg) | Add to Reading ListSource URL: theory.stanford.edu- Date: 2015-04-26 18:37:48
|
---|